Semantic Analysis for Parallelizing C

نویسنده

  • Pierre David
چکیده

Automatic parallelization of C language programs is a diicult task due, for example, to side eeects within expressions and access to memory via pointers. We describe a method based on semantic analysis of the language, in order to detect parallelism in complex programs using pointer arithmetic. We deene semantic domains which respect the type system of the language, and use them to synthesize eeect of the program through functional objects called transformations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semantic Foundations of Commutativity Analysis

This paper presents the semantic foundations of commutativity analysis, an analysis technique for automatically parallelizing programs written in a sequential, imperative programming language. Commutativity analysis views the computation as composed of operations on objects. It then analyzes the program at this granularity to discover when operations commute (i.e. generate the same result regar...

متن کامل

Semantic Feature Analysis Treatment for Anomia of Two Nonfluent Persian-Speaking Aphasic Patients

Objectives: Semantic Feature Analysis was designed to improve lexical retrieval of aphasic patients via activation of semantic networks of the words. In this approach, the anomic patients are cured with semantic information to assist oral naming. The purpose of this study was to examine the effects of Semantic Feature Analysis treatment on anomia of two nonfluent aphasic patients. Methods: A...

متن کامل

Automatic Generation of Provably Correct Parallelizing Compilers

We show how parallelizing compilers can be automatically derived from denotational deenitions of programming languages. In our approach, the denotational deenition is expressed using deenite clause grammars (syntax speciication) and Horn Logic or Constraint Logic (semantic speciication). The conditions for executing two or more statements in parallel (e.g., GCD test, Banerjee test, or exact tes...

متن کامل

Parallelizing Description Logic Reasoning

Parallelizing Description Logic Reasoning Kejia Wu, Ph.D. Concordia University, 2014 Description Logic has become one of the primary knowledge representation and reasoning methodologies during the last twenty years. A lot of areas are benefiting from description logic based technologies. Description logic reasoning algorithms and a number of optimization techniques for them play an important ro...

متن کامل

Parallelizing Algebraic Reasoning for the Description Logic SHOQ

Reaching the full potential of the semantic web awaits the availability of highly scalable reasoners. Despite numerous efforts to optimize existing Description Logics reasoners, there is always the need to compromise the expressivity or the size of the used ontologies in time sensitive applications. Hybrid algebraic reasoning has been investigated in the context of optimizing reasoning with ont...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992